Exact solution of the isotropic majority-vote model on complete graphs

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Majority-vote model on random graphs.

The majority-vote model with noise on Erdös-Rényi's random graphs has been studied. Monte Carlo simulations were performed to characterize the order-disorder phase transition appearing in the system. We found that the value of the critical noise parameter qc is an increasing function of the mean connectivity z of the random graph. The critical exponents beta/nu, gamma/nu, and 1/nu were calculat...

متن کامل

Majority-Vote Model on Scale-Free Hypergraphs

Majority-vote models on scale-free hypergraphs are investigated by means of numerical simulations with different variants of system dynamics. Hypergraphs are generalisations of ordinary graphs in which higher order of social organisation is included by introducing hyperedges corresponding to social groups, connecting more than two nodes. In the models under study, opinions of agents (two-state ...

متن کامل

An Exact Isotropic Solution

The condition for pressure isotropy is reduced to a recurrence equation with variable, rational coefficients of order three. We prove that this difference equation can be solved in general. Consequently we can find an exact solution to the field equations corresponding to a static spherically symmetric gravitational potential in terms of elementary functions. The metric functions, the energy de...

متن کامل

Majority-vote model on Opinion-Dependent Networks

Received Day Month Year Revised Day Month Year We study a nonequilibrium model with up-down symmetry and a noise parameter q known as majority-vote model of M.J. Oliveira 1992 on opinion-dependent network or Stauffer-Hohnisch-Pittnauer networks. By Monte Carlo simulations and finite-size scaling relations the critical exponents β/ν, γ/ν, and 1/ν and points qc and U * are obtained. After extensi...

متن کامل

Majority-vote on directed Erdős–Rényi random graphs

Through Monte Carlo Simulation, the well-known majority-vote model has been studied with noise on directed random graphs. In order to characterize completely the observed order-disorder phase transition, the critical noise parameter qc, as well as the critical exponents β/ν, γ/ν and 1/ν have been calculated as a function of the connectivity z of the random graph.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Physical Review E

سال: 2017

ISSN: 2470-0045,2470-0053

DOI: 10.1103/physreve.96.012304